Abstract
There is a burgeoning literature surrounding the refinement and implementation of probabilistic proof systems. Applications include delegation of computation and closely related problems such as succinct (zero knowledge) arguments. After quickly summarizing the state of the art, I will give a wishlist for theoretical advances that would facilitate bridging the (still substantial) gap between "implemented protocol" and "practically deployable system."